Low-Density Lattice Codes
نویسندگان
چکیده
منابع مشابه
Low-Density Lattice Codes for Inter-Symbol Interference Channels
Low-density lattice codes (LDLC) designed for inter-symbol interference (ISI) channels are proposed in this paper, including the node-by-node belief propagation (BP) decoding algorithm and the construction of LDLC codes for ISI channels. A theorem is presented to illustrate that the nominal coding gain of LDLC codes can be increased by introducing ISI into the primary codes. Shaping operation m...
متن کاملLow Density Lattice Codes: from Theory to Practice
Recently, lattice theory has been considered as useful tool for information theory. It has been also shown that lattice codes can be a strong competitor to traditional capacity achieving coding schemes such as LDPC or Turbo codes. Lattice codes are also attractive due to the fact that code space and signal space are equal, instead of traditional codes, where these spaces are different. However,...
متن کاملImproving GGH Public Key Scheme Using Low Density Lattice Codes
Goldreich-Goldwasser-Halevi (GGH) public key cryptosystem is an instance of lattice-based cryptosystems whose security is based on the hardness of lattice problems. In fact, GGH cryptosystem is the lattice version of the first code-based cryptosystem, proposed by McEliece. However, it has a number of drawbacks such as; large public key length and low security level. On the other hand, Low Densi...
متن کاملLow Density Parity Check Codes
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...
متن کاملLow-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.917684